منابع مشابه
Centralized local and Distributed local Algorithms
We consider two models of computation: centralized local algorithms and local distributed algorithms. Algorithms in one model are adapted to the other model to obtain improved algorithms. Distributed vertex coloring is employed to design improved centralized local algorithms for: maximal independent set, maximal matching, and an approximation scheme for maximum (weighted) matching over bounded ...
متن کاملCentralized Clustering Method To Increase Accuracy In Ontology Matching Systems
Ontology is the main infrastructure of the Semantic Web which provides facilities for integration, searching and sharing of information on the web. Development of ontologies as the basis of semantic web and their heterogeneities have led to the existence of ontology matching. By emerging large-scale ontologies in real domain, the ontology matching systems faced with some problem like memory con...
متن کاملAdvantages of Distributed Systems over Centralized Systems
Distributed system can also be referred to as the process of running a single computational task on more than one distinct computer. There are a lot of advantages in distributed system including the ability to connect remote users with remote resources in an open and scalable way. A distributed system must be reliable and for it to be truly reliable it must possess the following characteristics...
متن کاملComparing Centralized and Decentralized Distributed Execution Systems
We implement two distributed execution systems one centralized and one decentralized. We test these systems in terms of how well they handle a high number of requests, distribute execution, and tolerate heterogeneity. Given the small size and homogeneity of our lab environment we find that the centralized system provides a much simpler yet equally effective alternative to the decentralized syst...
متن کاملLocal Conditioning in Bayesian Networks
Local conditioning (LC) is an exact algorithm for computing probability in Bayesian networks, developed as an extension of Kim and Pearl’s algorithm for singly-connected networks. A list of variables associated to each node guarantees that only the nodes inside a loop are conditioned on the variable which breaks it. The main advantage of this algorithm is that it computes the probability direct...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Physics: Conference Series
سال: 2020
ISSN: 1742-6588,1742-6596
DOI: 10.1088/1742-6596/1679/5/052009